A graph and its complement with specified properties. IV. Counting self-complementary blocks
نویسندگان
چکیده
منابع مشابه
Linear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملgraphs cospectral with a friendship graph or its complement
let $n$ be any positive integer and let $f_n$ be the friendship (or dutch windmill) graph with $2n+1$ vertices and $3n$ edges. here we study graphs with the same adjacency spectrum as the $f_n$. two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. let $g$ be a graph cospectral with $f_n$. here we prove that if $g$ has no cycle of length $4$ or $...
متن کاملSpecified Blocks
This paper argues that specified blocks have every advantage over the combination of assertions, preconditions, postconditions, invariants, and variants, both for verifying programs, and for program development. They are simpler, more general, easier to write, and they make proofs easier.
متن کاملvalidation of a revised logical-mathematical intelligence scale and exploring its relationship with english language proficiency
نظریه هوش چندگانه قسمتهای متفاوت هوش بشری را مورد بررسی قرار می دهد که با شناخت آن شخص به درک بهتری از توانایی های خود میرسد و در نتیجه سعی در استفاده از آن جهت یادگیری بهتر میکند. همچنین با شناخت استعداد دانش آموزان، فرایند یادگیری بهتر میشود. هدف از انجام دادن این تحقیق بررسی رابطه بین هوش ریاضی و استعداد یادگیری زبان انگلیسی میباشد. برای انجام این تحقیق از پرسشنامه هوش ریاضی که توسط شیرر در ...
On the Connectivity of a Graph and its Complement Graph
In this paper, we study the connectivity of the complement of a graph. We first establish a simple formula to compute the connectivity of a graph that comes from the join of graphs. Base on this formula, we give an upper and a lower bound to the connectivity of the complement of a graph. Keyword: connectivity, complement, join, vertex of attachment.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1981
ISSN: 0364-9024
DOI: 10.1002/jgt.3190050108